Congestion Control for Reliable Multicast Achieving TCP Fairness

نویسندگان

  • Kazunori YAMAMOTO
  • Miki YAMAMOTO
  • Hiromasa IKEDA
چکیده

In the paper, we propose a congestion control scheme for reliable multicast communication which enables TCP fairness and prevents a drop-to-zero problem. The proposed congestion control scheme is rate-based one based on NAKs from receivers and cooperatively works with a flow control scheme. The congestion control scheme consists of two components of a ratebased controller and a selection mechanism of a representative. The rate-based controller runs between the sender and the representative and achieves TCP fairness and fast response to losses at the representative. The selection mechanism of the representative allows the sender to select the representative in a scalable manner, in which the sender makes use of NAKs from receivers to select it. In the paper, we also propose the switchover mechanism of the flow and congestion control schemes which enables the sender to use either of them adaptively based on network situations. When the network is congested, the congestion control scheme works to share network resources fairly with competing TCP flows. Otherwise, the flow control scheme works to adapt the transmission rate to the slowest receiver. We verify the performance of our proposed schemes by using computer simulation. key words: reliable multicast, congestion control, ow control,

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Reliable Multicast Congestion Control (rmcc)

At present, there are no standardized, Internet-based multicast transport protocols that provide effective, dynamic congestion control methods for safe, widescale deployment of end-to-end rate adaptive applications (e.g., file transfer). Recent research and standardization efforts are beginning to address these issues. This paper describes ongoing research and development related to network con...

متن کامل

A TCP friendly, rate-based mechanism for NACK-oriented reliable multicast congestion control

In this paper, we describe ongoing work in adding congestion control extensions to an existing negative acknowledgement (NACK) oriented reliable multicast protocol. Our previous work adopted and used the concept of a dynamic worst path representative for equation-based rate adaptation at the multicast source and we have further refined this approach and present results here. We present an overv...

متن کامل

TCP Vegas-like Algorithm for Layered multicast Transmission

Layered multicast is probably the most elegant solution to tackle the heterogene ity problem in multicast delivery of real-time multimedia streams. However, the multiple join experiments carried out by different receivers in order to detect the available bandwidth make it hard to achieve fairness. In the present paper, we present a simple protocol, inspired from TCP-Vegas, that reduces consider...

متن کامل

MTCP: Scalable TCP-like Congestion Control for Reliable Multicast

We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multimedia and collaborative computing, yet nontrivial, because of the potentially large number of receivers involved. Many schemes have been proposed to handle the recovery of lost packets in a scalable manner, but there is...

متن کامل

Fairness of a Single-Rate Multicast Congestion Control Scheme

Recently, a TCP-friendly, single-rate multicast congestion control scheme called pgmcc was introduced by one of the authors. In this paper, we study the fairness of pgmcc in a variety of scenarios in which a multicast transfer session competes with long-lived TCP flows and web-like traffic. We evaluate fairness of the pgmcc scheme at different timescales and compare it with the fairness of the ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001